Where to Start a Geometric Random Walk?
نویسندگان
چکیده
منابع مشابه
Second Order Moment Asymptotic Expansions for a Randomly Stopped and Standardized Sum
This paper establishes the first four moment expansions to the order o(a^−1) of S_{t_{a}}^{prime }/sqrt{t_{a}}, where S_{n}^{prime }=sum_{i=1}^{n}Y_{i} is a simple random walk with E(Yi) = 0, and ta is a stopping time given by t_{a}=inf left{ ngeq 1:n+S_{n}+zeta _{n}>aright} where S_{n}=sum_{i=1}^{n}X_{i} is another simple random walk with E(Xi) = 0, and {zeta _{n},ngeq 1} is a sequence of ran...
متن کاملEfficiently navigating a random Delaunay triangulation
Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution ...
متن کاملJohn's Walk
We present an affine-invariant random walk for drawing uniform random samples from a convex body K Ă Rn for which the maximum volume inscribed ellipsoid, known as John’s ellipsoid, may be computed. We consider a polytope P “ x P Rn ˇ̌ Ax ď 1 ( where A P R as a special case. Our algorithm makes steps using uniform sampling from the John’s ellipsoid of the symmetrization of K at the current point....
متن کاملHalting in Random Walk Kernels
Random walk kernels measure graph similarity by counting matching walks in two graphs. In their most popular form of geometric random walk kernels, longer walks of length k are downweighted by a factor of λ (λ < 1) to ensure convergence of the corresponding geometric series. We know from the field of link prediction that this downweighting often leads to a phenomenon referred to as halting: Lon...
متن کاملThe Poisson Boundary of Lamplighter Random Walks on Trees
Let Tq be the homogeneous tree with degree q + 1 ≥ 3 and G a finitely generated group whose Cayley graph is Tq. The associated lamplighter group is the wreath product Zr ≀ G, where Zr is the cyclic group of order r. For a large class of random walks on this group, we prove almost sure convergence to a natural geometric boundary. If the probability law governing the random walk has finite first ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003